#include<iostream>
#include<stdlib.h>
using namespace std;
void MergeSortNonR(int*a,int n)
{
	int* tmp = (int*)malloc(sizeof(int) * n);

	int gap = 1;
	while (gap < n)
	{
		int j = 0;
		for (int i = 0; i < n; i += 2 * gap)
		{
			int begin1 = i;
			int end1 = i + gap - 1;
			int begin2 = i + gap;
			int end2 = i + 2 * gap - 1;
			if (end1 >= n || begin2 >= n)
			{
				break;
			}
			if (end2 >= n)
			{
				end2 = n - 1;

			}
			while (begin1 <= end1 && begin2 <= end2)
			{
				if (a[begin1]<a[begin2])
				{
					tmp[j++] = a[begin1++];

				}
				if (a[begin2] < a[begin1])
				{
					tmp[j++] = a[begin2++];

				}




			}
			while (begin1 <= end1)
			{
				tmp[j++] = a[begin1++];



			}
			while (begin2 <= end2)
			{
				tmp[j++] = a[begin2++];

			}
			memcpy(a + i, tmp + i, sizeof(int) * (end2 - i + 1));
		}
        

		
		gap *= 2;



	}

}


int main()
{

	int arr[9] = { 5,9,6,75,3,56,14,26,50};
	MergeSortNonR(arr, 9);
	for (int i = 0; i < 9; i++)
	{
		cout << arr[i] << endl;


	}




}